Multitree-Multiobjective Multicast Routing for Traffic Engineering
نویسندگان
چکیده
This paper presents a new traffic engineering multitreemultiobjective multicast routing algorithm (M-MMA) that solves for the first time the GMM model for Dynamic Multicast Groups. Multitree traffic engineering uses several trees to transmit a multicast demand from a source to a set of destinations in order to balance traffic load, improving network resource utilization. Experimental results obtained by simulations using eight real network topologies show that this new approach gets trade off solutions while simultaneously considering five objective functions. As expected, when M-MMA is compared to an equivalent singletree alternative, it accommodates more traffic demand in a high traffic saturated network.
منابع مشابه
GMM-model for Dynamic Multicast Groups using a probabilistic BFS Algorithm
Generalized Multiobjective Multitree model (GMMmodel) considering by the first time multitree-multicast load balancing with splitting in a multiobjective context. To solve the GMM-model, a multiobjective evolutionary algorithm (MOEA) inspired by the Strength Pareto Evolutionary Algorithm (SPEA) was proposed. In this paper, we extends the GMM-model to dynamic multicast groups (i.e., in which egr...
متن کاملMultiobjective Multicast Routing with Ant Colony Optimization
This work presents a multiobjective algorithm for multicast traffic engineering. The proposed algorithm is a new version of MultiObjective Ant Colony System (MOACS), based on Ant Colony Optimization (ACO). The proposed MOACS simultaneously optimizes the maximum link utilization, the cost of the multicast tree, the averages delay and the maximum end-to-end delay. In this way, a set of optimal so...
متن کاملMultiobjective Multitree model solution using MOEA
In a previous paper a novel Generalized Multiobjective Multitree model (GMM-model) was proposed. This model considers for the first time multitree-multicast load balancing with splitting in a multiobjective context, whose mathematical solution is a whole Pareto optimal set that can include several results than it has been possible to find in the publications surveyed. To solve the GMM-model, in...
متن کاملMultitree Routing for Multicast Flows: A Genetic Algorithm Approach
To create a multicast routing distribution tree ensuring quality constraints is a NP-Hard problem. Many algorithm have been made to solve this issue, and genetic algorithms (GA) have shown better response times and solutions for this problem. This paper aligns related work by presenting algorithms in multicast routing using GAs and, taking its advantage, gives a proposal for solving this proble...
متن کاملA Multi-Objective Optimization Scheme for Multicast Routing: A Multitree Approach
In this paper, we propose a multi-objective traffic engineering scheme using different distribution trees to multicast several flows. The aim is to combine into a single aggregated metric, the following weighting objectives: the maximum link utilization, the hop count, the total bandwidth consumption, and the total end-to-end delay. Moreover, our proposal solves the traffic split ratio for mult...
متن کامل